Combinatorial and Automated Proofs of Certain Identities
نویسندگان
چکیده
This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machineassisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.
منابع مشابه
Combinatorial Proofs of q-Series Identities
We provide combinatorial proofs of six of the ten q-series identities listed in [3, Theorem 3]. Andrews, Jiménez-Urroz and Ono prove these identities using formal manipulation of identities arising in the theory of basic hypergeometric series. Our proofs are purely combinatorial, based on interpreting both sides of the identities as generating functions for certain partitions. One of these iden...
متن کاملPath Counting and Random Matrix Theory
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these identities arise from combinatorial interpretations of certain properties of the β-Hermite and β-Laguerre ensembles of random matrix theory. We conclude by p...
متن کاملOn Proofs of Certain Combinatorial Identities George Grossman, Akalu Tefera and Aklilu Zeleke
In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated proofs using the Wilf-Zeilberger(WZ) method.
متن کاملHuman and constructive proof of combinatorial identities: an example from Romik
It has become customary to prove binomial identities by means of the method for automated proofs as developed by Petkovšek, Wilf and Zeilberger [12]. In this paper, we wish to emphasize the role of “human” and constructive proofs in contrast with the somewhat lazy attitude of relaying on “automated” proofs. As a meaningful example, we consider the four formulas by Romik [14], related to Motzkin...
متن کاملRamanujan's lost notebook: Combinatorial proofs of identities associated with Heine's transformation or partial theta functions
Combinatorial proofs are given for certain entries in Ramanujan’s lost notebook. Bijections of Sylvester, Franklin, and Wright, and applications of Algorithm Z of Zeilberger are employed. A new bijection, involving the new concept of the parity sequence of a partition, is used to prove one of Ramanujan’s fascinating identities for a partial theta function.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011